Asymptotic analysis of proportional fair algorithm
نویسنده
چکیده
Jack M. Holtzman Qualcomm, Inc. 5775 Morehouse Drive, San Diego, Ca 92121-1714 [email protected] It was previously shown (under simplifying assumptions) that this algorithm gives equal power and time to users who only differ in the distance from the BS, their fading characteristics being the same. We give here a more general result for two classes of users with different fading characteristics. All other things being equal, the user class with more fading variability gets more throughput with a lower (but not much lower) fraction of time transmitting. We also demonstrate a separability property the effects of variablity and distance from the base station are separable.
منابع مشابه
A Stochastic Network Under Proportional Fair Resource Control - Diffusion Limit with Multiple Bottlenecks
We study a multi-class stochastic processing network operating under the so-called proportional fair allocation scheme, and following the head-of-the-line processor sharing discipline. Specifically, each server’s capacity is shared among the job classes that require its service; and allocated, in every state of the network, among the first waiting job of each class to maximize a log-utility fun...
متن کاملAsymptotic Properties of Proportional-Fair Sharing Algorithms
We are concerned with the allocation of channel or transmitter resources for time varying mobile communications. There are many users who are competing to transmit data over the resource. Time is divided into small scheduling intervals, and information on the channel rates for the various users is available at the start of the intervals. Since the rates vary randomly, there is a conflict at any...
متن کاملOn the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
We consider the model where N queues (users) are served in discrete time by a generalized switch. The switch state is random, and it determines the set of possible service rate choices (scheduling decisions) in each time slot. This model is primarily motivated by the problem of scheduling transmissions of N data users in a shared time-varying wireless environment, but also includes other applic...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملA Differentiated Pricing Framework for Improving the Performance of the Elastic Traffics in Data Networks
Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions...
متن کامل